The weak call-by-value λ-calculus is reasonable for both time and space
نویسندگان
چکیده
منابع مشابه
Call-by-Value λ-calculus and LJQ
LJQ is a focused sequent calculus for intuitionistic logic, with a simple restriction on the first premiss of the usual left introduction rule for implication. In a previous paper we discussed its history (going back to about 1950, or beyond) and presented its basic theory and some applications; here we discuss in detail its relation to call-by-value reduction in lambda calculus, establishing a...
متن کاملProof nets and the call-by-value λ-calculus
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize an isomorphism between the two systems: every single rewriting step on the calculus maps to a single step on proof nets, and viceversa. In this way, we obtain an algebraic reformulation of proof nets...
متن کاملA call-by-value λ -calculus with lists and control
Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also include data types. As a step into that direction, this paper defines a simply typed call-by-value λ -calculus with the control operators catch and throw, a data t...
متن کاملCall-by-Name, Call-by-Value and the lambda-Calculus
This paper examines the old question of the relationship between ISWIM and the &calculus, using the distinction between call-by-value and call-by-name. It is held that the relationship should be mediated by a standardisation theorem. :3ince this leads to difficulties, a new &calcu%~s is introduced whose standardisation theorem gives a good correspondence with ISWIM a-; given by the SECT machine...
متن کاملImplementation of the Typed Call-by-Value λ-calculus using a Stack of Regions
We present a translation scheme for the polymorphically typed call-by-value λ-calculus. All runtime values, including function closures, are put into regions. The store consists of a stack of regions. Region inference and effect inference are used to infer where regions can be allocated and de-allocated. Recursive functions are handled using a limited form of polymorphic recursion. The translat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3371095